package 代码随想2._3哈希表;

/**
 * @author XXX
 * @date 2024-01-14 21:36
 */

import java.util.HashMap;

/**
 * https://leetcode.cn/problems/two-sum/description/
 */
public class _4两数之和 {
    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer,Integer> map = new HashMap<>();
        for(int i=0;i<nums.length;i++){
            if(map.containsKey(target-nums[i]))
                return new int[]{i,map.get(target-nums[i])};
            map.put(nums[i],i);
        }
        return new int[0];
    }
}
